Efficient Massive Sharing of Content among Peers
نویسندگان
چکیده
In this paper we focus on the design of high performance peer-to-peer content sharing systems. In particular, our goal is to achieve global load balancing and short user-request response times. This is a formidable challenge, given the requirement to respect the autonomy of peers, their heterogeneity in terms of processing and storage capacities, their different content contributions, the huge system scale, and the dynamic system environment. Our approach exploits the semantic categorization of published documents and constructs clusters of peers. We provide a formal formulation for the problem of load balancing in our setting and prove that it is NP-complete. We also present a greedy polynomial time algorithm that achieves nearly optimal load balancing as shown by our experimental results.
منابع مشابه
Scalable and efficient file sharing in information-centric networking
Internet usage has been increasingly shifting toward massive content retrieval and distribution. To satisfy the demand, information-centric networking (ICN) approaches have emerged. These approaches have common features such as in-network caching and the decoupling of content and location. Such a content-centric communication model enables efficient content delivery. In this article, we investi...
متن کاملA Secure and User Privacy-Preserving Searching Protocol for Peer-to-Peer Networks
File sharing peer-to-peer networks have become quite popular of late as a new paradigm for information exchange among large number of users in the Internet. However, these networks suffer from several problems such as fake content distribution, free riding, whitewashing, poor search scalability, lack of a robust trust model and absence of user privacy protection mechanism. In this paper, a secu...
متن کاملDelay Bounds of Peer-to-Peer Video Streaming
Peer-to-Peer (P2P) systems exploit the uploading bandwidth of individual peers to distribute content at low server cost. While the P2P bandwidth sharing design is very efficient for bandwidth sensitive applications, it imposes a fundamental performance constraint for delay sensitive applications: the uploading bandwidth of a peer cannot be utilized to upload a piece of content until it complete...
متن کاملThwarting P2P Pollution Using Object Reputation
This paper describes Credence, a distributed object reputation management scheme for combating content pollution in peer-to-peer filesharing systems. Credence enables honest peers to assess the authenticity of online content by securely tabulating and managing endorsements from other peers. Credence employs a novel voter correlation scheme to weight peer opinions, which gives rise to favorable ...
متن کاملStrategies of Collaboration in Multi-Swarm Peer-to-Peer Con-tent Distribution
In modern Peer-to-Peer (P2P) content distribution applications, multiple swarms typically exist, each corresponding to the dissemination of one content among interested peers. A common design in the existing P2P applications is to allow peers in one swarm to help each other, while different swarms are only coupled when sharing the upload bandwidth at the dedicated content servers/publishers. In...
متن کامل